Linkless symmetric drawings of series parallel digraphs
نویسندگان
چکیده
منابع مشابه
Linkless symmetric drawings of series parallel digraphs
In this paper, we present a linear time algorithm for constructing linkless drawings of series parallel digraphs with maximum number of symmetries. Linkless drawing in three dimensions is a natural extension to planar drawing in two dimensions. Symmetry is one of the most important aesthetic criteria in graph drawing. More specifically, we present two algorithms: a symmetry finding algorithm wh...
متن کاملUpward Planar Drawings of Series-Parallel Digraphs with Maximum Degree Three
An upward planar drawing of a digraph G is a planar drawing of G where every edge is drawn as a simple curve monotone in the vertical direction. A digraph is upward planar if it has an embedding that admits an upward planar drawing. The problem of testing whether a digraph is upward planar is NP-complete. In this paper we give a linear-time algorithm to test the upward planarity of a series-par...
متن کاملDrawing series parallel digraphs symmetrically
In this paper we present algorithms for drawing series parallel digraphs with as much symmetry as possible. The first step is to compute a certain kind of automorphism, called an “upward planar automorphism” for an input series parallel digraph. The next step uses these automorphisms to construct a symmetric drawing of the graph. We present several variations of the second step, with visibility...
متن کاملUpgrading Vertices In Trees, Series-Parallel Digraphs And General Series-Parallel Digraphs To Bound Path Length+
We consider trees, series-parallel digraphs, and general series-parallel digraphs that have vertex weights and delays. The length/delay of a path is the sum of the delays on the path. We show that minimal weight vertex subsets X such that the length of the longest path is bounded by a given value δ when all vertices in X are upgraded to have delay 0 can be found in pseudo polynomial time. In ca...
متن کاملKnuthian Drawings of Series-Parallel Flowcharts
Inspired by a classic paper by Knuth, we revisit the problem of drawing flowcharts of loopfree algorithms, that is, degree-three series-parallel digraphs. Our drawing algorithms show that it is possible to produce Knuthian drawings of degree-three series-parallel digraphs with good aspect ratios and small numbers of edge bends.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2004
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2004.04.004